منابع مشابه
Mixed Matrices — Irreducibility and Decomposition — ∗
This paper surveys mathematical properties of (layered-) mixed matrices with emphasis on irreducibility and block-triangular decomposition. A matrix A is a mixed matrix if A = Q + T , where Q is a “constant” matrix and T is a “generic” matrix (or formal incidence matrix) in the sense that the nonzero entries of T are algebraically independent parameters. A layered mixed (or LM-) matrix is a mix...
متن کاملEla Schur Complements of Generally Diagonally Dominant Matrices and a Criterion for Irreducibility of Matrices∗
As is well known, the Schur complements of strictly or irreducibly diagonally dominant matrices are H−matrices; however, the same is not true of generally diagonally dominant matrices. This paper proposes some conditions on the generally diagonally dominant matrix A and the subset α ⊂ {1, 2, . . . , n} so that the Schur complement matrix A/α is an H−matrix. These conditions are then applied to ...
متن کاملIRREDUCIBILITY OF COMMUTING VARIETY ASSOCIATED WITH (son+m, son⊕som)
The ground field k is algebraically closed and of characteristic zero. Let g be a reductive algebraic Lie algebra over k and σ an involutory automorphism of g. Then g = g0 ⊕ g1 is the direct sum of σ-eigenspaces. Here g0 is a reductive subalgebra and g1 is a g0-module. Let G be the adjoint group of g and G0 ⊂ G a connected subgroup with LieG0 = g0. The commuting variety of (g, g0) is the follow...
متن کاملOn the Irreducibility of Associated Varieties of W-algebras
We investigate the irreducibility of the nilpotent Slodowy slices that appear as the associated variety of W -algebras. Furthermore, we provide new examples of vertex algebras whose associated variety has finitely many symplectic leaves. Dedicated to the 60th birthday of Professor Efim Zelmanov
متن کاملClique Irreducibility and Clique Vertex Irreducibility of Graphs
A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1981
ISSN: 0024-3795
DOI: 10.1016/0024-3795(81)90162-2